A General Proof Method for Modal Predicate Logic without the Barcan Formula
نویسندگان
چکیده
We present a general proof method for normal systems of modal predicate logic with identical inference rules for each such logic. Different systems are obtained by changing the conditions under which two formulas are considered complementary. The paper extends previous work in that we are no longer confined. to models in which the Barcan formula and its converse hold. This allows the domain of individuals to vary from world to world. Modifications to the original inference rules are given, and a semantic justification is provided.
منابع مشابه
A General Proof Method for First-Order Modal Logic
We present a general sequent-based proof method for first-order modal logics in which the Barcan formula holds. The most important feature of our system is the fact that it has identical inference rules for every modal logic; different modal logics can be obtained by changing the conditions under which two formulas are allowed to resolve against each other It is argued that the proof method is ...
متن کاملShakespearian Modal Logic: A Labelled Treatment of Modal Identity
In this paper we describe a modal proof system arising from the combination of a tableau-like classical system, which incorporates a restricted (“analytical”) version of the cut rule, with a label formalism which allows for a speicialised, logic dependant unification algorithm. The system provides a uniform proof-theoretical treatment of first-order (normal) modal logics with identity, with and...
متن کاملLabelled Proofs for Quantified Modal Logic
In this paper we describe a modal proof system arising from the combination of a tableau-like classical system, which incorporates a restricted (“analytic”) version of the cut rule, with a label formalism which allows for a specialised, logic-dependent unification algorithm. The system provides a uniform proof-theoretical treatment of first-order (normal) modal logics with and without the Barca...
متن کاملKripke Incompleteness of Some Predicate Extensions of Modal Subframe Logics without Finite Embedding Property
Let Q-L be the least predicate extension of a normal extension L of S4 and BF be the Barcan formula ∀x2A(x) ⊃ 2∀xA(x). Ghilardi [3] showed that it is rare that Q-L is complete with respect to Kripke semantics. On the other hand, if L is a subframe logic with the finite embedding property, we can show the completeness of Q-L + BF by the method of canonical models (cf. Lemma 3 [2], Theorem 3.9 [5...
متن کاملA Unified Completeness Theorem for Quantified Modal Logics
A general strategy for proving completeness theorems for quantified modal logics is provided. Starting from free quantified modal logic K, with or without identity, extensions obtained either by adding the principle of universal instantiation or the converse of the Barcan formula or the Barcan formula are considered and proved complete in a uniform way. Completeness theorems are also shown for ...
متن کامل